Uniied Inference in Extended Syllogism 1. Term Logic vs. Predicate Logic
نویسنده
چکیده
There are two major traditions in formal logic: term logic and propo-sitional/predicate logic, exempliied respectively by the Syllogism of Aristotle and the First-Order Predicate Logic founded by Frege, Rus-sell, and Whitehead. Term logic is diierent from predicate logic in both its knowledge representation language and its inference rules. Term logic represents knowledge in subject{predicate statements. In the simplest form, such a statement contains two terms, linked together by an inheritance relation: S P where S is the subject term of the statement, and P is the predicate term. Intuitively, this statement says that S is a specialization (instan-tiation) of P, and P is a generalization (abstraction) of S. This roughly corresponds to \S is a kind of P" in English. Term logic uses syllogistic inference rules, in each of which two statements sharing a common term generate a new statement linking the two unshared terms. In Aristotle's syllogism (Aristotle, 1989), all statements are binary (that is, either true or false), and all valid inference rules are deduction, therefore when both premises are true, the conclusion is guaranteed to be true. When Aristotle introduced the deduction/induction distinction , he presented it in term logic, and so did Peirce when he added abduction into the picture (Peirce, 1931). According to Peirce, the de-duction/abduction/induction triad is deened formally in terms of the position of the shared term: c 1998 Kluwer Academic Publishers. Printed in the Netherlands.
منابع مشابه
A Critical Examination of Ibn-Sina’s Theory of the Conditional Syllogism
This paper will examine Ibn Sina’s theory of the Conditional Syllogism from a purely logical point of view, and will lay bare the principles he adopted for founding his theory, and the reason why the newly introduced part of his logic remained undeveloped and eventually was removed from the texts of logic in the later Islamic tradition. As a preliminary discussion, this paper briefly examines I...
متن کاملSuhrawardi's Modal Syllogisms
Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...
متن کاملParaconsistent Relational Model: A Quasi-Classic Logic Approach
The well-founded model for any general deductive database computed using the paraconsistent relational model, based on four-valued logic, does not support inference rules such as disjunctive syllogism. In order to support disjunctive syllogism, we utilize the generalization of the relational model to quasi-classic (QC) logic, whose inference power is much closer to classical logic. As the parac...
متن کاملProbabilistic Quantifier Logic for General Intelligence: An Indefinite Probabilities Approach
Indefinite probabilities are a novel technique for quantifying uncertainty, which were created as part of the PLN (Probabilistic Logic Networks) logical inference engine, which is a key component of the Novamente Cognition Engine (NCE), an integrative AGI system. Previous papers have discussed the use of indefinite probabilities in the context of a variety of logical inference rules, but have o...
متن کاملOrder-sorted logic programming with predicate hierarchy
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to useful expressions and inference methods for structural knowledge that ordinary first-order logic lacks. Nitta et al. pointed out that for legal reasoning a sort-hierarchy (or a sorted term) is not sufficient to describ...
متن کامل